Algorithmic Blending
نویسندگان
چکیده
منابع مشابه
Algorithmic Aspects of Theory Blending
In Cognitive Science, conceptual blending has been proposed as an important cognitive mechanism that facilitates the creation of new concepts and ideas by constrained combination of available knowledge. It thereby provides a possible theoretical foundation for modeling high-level cognitive faculties such as the ability to understand, learn, and create new concepts and theories. Quite often the ...
متن کاملTowards a computational- and algorithmic-level account of concept blending using analogies and amalgams
Concept blending – a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously separate elements, and enables reasoning and inference over the combination – is taken as a key element of creative thought and combinatorial creativity. In this article, we summarise our ...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملBlending basics
This article serves as a primer for the theory of online meaning construction known alternately as conceptual blending, conceptual integration, the many space model, and the network theory. Our tutorial proceeds by analyzing novel and conventional examples of linguistic and nonlinguistic blends that pertain to topics of reference, partitioning, mapping, structure projection, and dynamic mental ...
متن کاملBlending margins
We investigate properties of the formula p → 2p in the basic modal logic K. We show that K satisfies an infinitary weak variant of the rule of margins, which leads to a description of a complete set of unifiers of p → 2p. Using this information, we establish that K has nullary unification type. Moreover, we show that the formula p → 2p is admissibly saturated, but not exact.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1993
ISSN: 0021-9045
DOI: 10.1006/jath.1993.1008